Matching Preclusion Problem in Restricted HL - graphs and
نویسنده
چکیده
The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any ≥ , the matching preclusion numbers of both -dimensional restricted HL-graph and recursive circulant are equal to degree of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.
منابع مشابه
NP-completeness of anti-Kekulé and matching preclusion problems
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of molecules. Matching preclusion and conditional matching preclusion were proposed as measures of robustness in the event of edge failure in interconnection networks. It is known that matching preclusion problem on bipartite graphs is NP-complete. In this paper, we mainly prove that anti-Kekulé problem on...
متن کاملConditional matching preclusion for hypercube-like interconnection networks
The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...
متن کاملStrong Matching Preclusion of Arrangement Graphs
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The class of arrangement graphs was introduced as a common generalization of star graphs and alternating group g...
متن کاملStrong matching preclusion of (n, k)-star graphs
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The generalized (n, k)-star graph was introduced to address scaling issues of the star graph, and it has many de...
متن کاملStrong matching preclusion of burnt pancake graphs
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...
متن کامل